Belief propagation on the random k-SAT model

نویسندگان

چکیده

Corroborating a prediction from statistical physics, we prove that the belief propagation message passing algorithm approximates partition function of random k-SAT model well for all clause/variable densities and inverse temperatures which modest absence long-range correlations condition is satisfied. This known as “replica symmetry” in physics language. From this result deduce replica symmetry breaking phase transition occurs at low temperature below but close to satisfiability threshold.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Belief Propagation Guided Decimation for Random k-SAT

Let Φ be a uniformly distributed random k-SAT formula with n variables and m clauses. Non-constructive arguments show that Φ is satisfiable for clause/variable ratios m/n ≤ rk ∼ 2 ln 2 with high probability. Yet no efficient algorithm is know to find a satisfying assignment for densities as low as m/n ∼ rk · ln(k)/k with a non-vanishing probability. In fact, the density m/n ∼ rk · ln(k)/k seems...

متن کامل

Reweighted Belief Propagation and Quiet Planting for Random K-SAT

We study the random K-satisfiability problem using a partition function where each solution is reweighted according to the number of variables that satisfy every clause. We apply belief propagation and the related cavity method to the reweighted partition function. This allows us to obtain several new results on the properties of random K-satisfiability problem. In particular the reweighting al...

متن کامل

Survey Propagation for Random K-sat problems

This report will attempt to summarize some recent research on the random Ksat problem. After a brief introduction, we will describe some recently proposed algorithms for random K-sat, in particular the “survey propagation” algorithm. We will explain the equivalence of survey propagation to an appropriately defined belief propagation iteration, which a well-known iterative technique for estimati...

متن کامل

On an online random k-SAT model

Given n Boolean variables x1, . . . , xn, a k-clause is a disjunction of k literals, where a literal is a variable or its negation. Suppose random k-clauses are generated one at a time and an online algorithm accepts or rejects each clause as it is generated. Our goal is to accept as many randomly generated k-clauses as possible with the condition that it must be possible to satisfy every claus...

متن کامل

Balanced K-SAT and Biased random K-SAT on trees

Abstract We study and solve some variations of the random K-satisfiability problem balanced K-SAT and biased random K-SAT on a regular tree, using techniques we have developed earlier [14]. In both these problems, as well as variations of these that we have looked at, we find that the SATUNSAT transition obtained on the Bethe lattice matches the exact threshold for the same model on a random gr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Applied Probability

سال: 2022

ISSN: ['1050-5164', '2168-8737']

DOI: https://doi.org/10.1214/21-aap1772